Irrational Mixed Decomposition and Sharp Fewnomial Bounds for Tropical Polynomial Systems
نویسنده
چکیده
Given convex polytopes P1, . . . , Pr ⊂ R n and finite subsets WI of the Minkowsky sums PI = � i∈I Pi, we consider the quantityN(W) = � I⊂[r] (−1) r−|I|� WI � �. If WI = Z n ∩ PI and P1, . . . , Pn are lattice polytopes in R , then N(W) is the classical mixed volume of P1, . . . , Pn giving the number of complex solutions of a general complex polynomial system with Newton polytopes P1, . . . , Pn. We develop a technique that we call irrational mixed decomposition which allows us to estimate N(W) under some assumptions on the family W = (WI). In particular, we are able to show the nonnegativity of N(W) in some important cases. A special attention is paid to the family W = (WI) defined by WI = � i∈I Wi, where W1, . . . ,Wr are finite subsets of P1, . . . , Pr. The associated quantityN(W) is called discrete mixed volume ofW1, . . . ,Wr. Using our irrational mixed decomposition technique, we show that for r = n the discrete mixed volume is an upper bound for the number of nondegenerate solutions of a tropical polynomial system with supports W1, . . . ,Wn ⊂ R . We also prove that the discrete mixed volume associated with W1, . . . ,Wr is bounded from above by the Kouchnirenko number � r i=1(|Wi| − 1). For r = n this number was proposed as a bound for the number of nondegenerate positive solutions of any real polynomial system with supports W1, . . . ,Wn ⊂ R . This conjecture was disproved, but our result shows that the Kouchnirenko number is a sharp bound for the number of nondegenerate positive solutions of real polynomial systems constructed by means of the combinatorial patchworking.
منابع مشابه
Fewnomial Bounds for Completely Mixed Polynomial Systems
We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the polynomials is not taken into account. Introduction In 1980, A. Khovanskii [8] showed that a system of n polynomials in n variables involving l+n+1 distinct monomi...
متن کاملDescartes’ Rule for Trinomials in the Plane and Beyond
We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees counted only non-degenerate roots and even then gave much larger bounds, e.g., 248832 via a famous general result of Khovanski. Our bound is sharp, allows real exponents, and extends to certain systems of n-variate fewnomials....
متن کاملCounting Isolated Roots of Trinomial Systems in the Plane and Beyond
We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees counted only non-degenerate roots and even then gave much larger bounds, e.g., 248832 via a famous general result of Khovanski. Our bound is sharp, allows real exponents, and extends to certain systems of n-variate fewnomials,...
متن کاملDescartes’ Rule for Trinomials in the Plane and Beyond
We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees counted only non-degenerate roots and even then gave much larger bounds, e.g., 248832 via a famous general result of Khovanski. Our bound is sharp, allows real exponents, and extends to certain systems of n-variate fewnomials,...
متن کاملFewnomial Systems with Many Roots, and an Adelic Tau Conjecture
Consider a system F of n polynomials in n variables, with a total of n+ k distinct exponent vectors, over any local field L. We discuss conjecturally tight bounds on the maximal number of non-degenerate roots F can have over L, with all coordinates having fixed phase, as a function of n, k, and L only. In particular, we give new explicit systems with number of roots approaching the best known u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 55 شماره
صفحات -
تاریخ انتشار 2016